-
1 decimation in frequency
abbr. DIFпрореживание в частотной области [по частоте]; ср. decimation in timeАнгло-русский словарь промышленной и научной лексики > decimation in frequency
-
2 decimation in time
abbr. DITпрореживание во временной области [по времени]; ср. decimation in frequencyАнгло-русский словарь промышленной и научной лексики > decimation in time
-
3 DIF
decimation in frequency — прореживание в частотной области [по частоте] -
4 децимация по частоте
Русско-английский словарь нормативно-технической терминологии > децимация по частоте
-
5 Прореживание по частоте
Русско-английский словарь по прикладной математике и механике > Прореживание по частоте
См. также в других словарях:
Decimation (signal processing) — This article is related to signal processing. For other meanings of the word Decimation, please see Decimation (disambiguation). In digital signal processing, decimation is a technique for reducing the number of samples in a discrete time signal … Wikipedia
Butterfly diagram — used for finding the most likely sequence of hidden states.Most commonly, the term butterfly appears in the context of the Cooley Tukey FFT algorithm, which recursively breaks down a DFT of composite size n = r m into r smaller transforms of size … Wikipedia
Bruun's FFT algorithm — Bruun s algorithm is a fast Fourier transform (FFT) algorithm based on an unusual recursive polynomial factorization approach, proposed for powers of two by G. Bruun in 1978 and generalized to arbitrary even composite sizes by H. Murakami in 1996 … Wikipedia
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia
Cooley-Tukey FFT algorithm — The Cooley Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller… … Wikipedia
Split-radix FFT algorithm — The split radix FFT is a fast Fourier transform (FFT) algorithm for computing the discrete Fourier transform (DFT), and was first described in an obscure paper by R. Yavne (1968) and subsequently rediscovered simultaneously by various authors in… … Wikipedia
List of independent discoveries — Independent discoveries in science, termed multiples by Robert K. Merton, are instances in which similar discoveries are made by scientists working independently of each other. [http://books.google.com/books?vid=ISBN0226520714 id=eprv7hMdO IC… … Wikipedia
DIF — • Data/Document Interchange Format • Digital Interface • Documents Integration Facility • Decimation in Frequency (bei der FFT) • Dansk Ingeniorforening • Discrete Increment Filter NASA … Acronyms
DIF — [1] Data/Document Interchange Format [2] Digital Interface [3] Documents Integration Facility [4] Decimation in Frequency (bei der FFT) [5] Dansk Ingeniorforening [6] Discrete Increment Filter ( > NASA Acronym List ) … Acronyms von A bis Z
Delta-sigma modulation — Delta sigma (ΔΣ; or sigma delta, ΣΔ) modulation is a method for encoding high resolution or analog signals into lower resolution digital signals. The conversion is done using error feedback, where the difference between the two signals is… … Wikipedia
JESD204 — JEDEC JESD204A (2008) is a new industry standard for the interconnection of digital to analog converter (DAC or D to A) or analog to digital converter (abbreviated ADC, A/D or A to D) and logic devices which supports the concept of multiple… … Wikipedia
